Finding the most efficient paths between two vertices in a knapsack-item weighted graph
نویسندگان
چکیده
منابع مشابه
a cross-comparative dtudy between two textbook series in terms of the presentation of politeness
چکیده ندارد.
15 صفحه اولGraph partition into paths containing specified vertices
For a graph G, let 2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163–169) conjectured that, if a partition n = ∑k i=1 ai is given and 2(G)¿ n + k − 1, then for any k distinct vertices v1; : : : ; vk , G can be decomposed into vertex-disjoint paths P1; : : : ; Pk such that |V (Pi)| = ai and vi is ...
متن کاملFinding Cut-Vertices in the Square Roots of a Graph
The square of a given graph H = (V,E) is obtained from H by adding an edge between every two vertices at distance two in H. Given a graph class H, the H-Square Root problem asks for the recognition of the squares of graphs in H. In this paper, we answer positively to an open question of [Golovach et al., IWOCA’16] by showing that the squares of cactus block graphs can be recognized in polynomia...
متن کاملAbout the finding of independent vertices of a graph Anatoly
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twinorthogonal graphs. The problem is formulated which is dual to the problem above. It is shown that, for trivial twin-orthogonal graphs, any of its maximal independent set is also maximum one. 1 State...
متن کاملAbout the finding of independent vertices of a graph
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twinorthogonal graphs. The problem is formulated which is dual to the problem above. It is shown that, for trivial twin-orthogonal graphs, any of its maximal independent set is also maximum one. 1 State...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Research
سال: 2016
ISSN: 2249-7277,2277-7970
DOI: 10.19101/ijacr.2017.728003